In recognition memory paradigms, emotional details are often recognised better than neutral ones, but at the cost of memory for peripheral details. We previously provided evidence that, when periph...

Cultivating an understanding of ethical responsibilities and the societal impacts of technology is increasingly recognized as an important component in undergraduate engineering curricula. There is growing research on how ethics-related topics are taught and outcomes are attained, especially in the context of accreditation criteria. However, there is a lack of theoretical and empirical understanding of the role that educators play in ethics and societal impacts instruction and the factors that motivate and shape their inclusion of this subject in the courses (...) they teach and co-curricular activities they mentor. The goal of this research was to explore the role of faculty’s personal influences on their inclusion of ESI instruction in these settings. Personal influences are distinguished from external or environmental drivers such as teaching assignments, university policies, and department curriculum decisions. This research employed a grounded theory methodology and extracted data from interviews with 19 educators who teach ESI to engineering students to develop an emergent conceptualization of personal influences. Four categorie were identified: intrapersonal, interpersonal, academic, and professional. The findings suggested a wide range of entry points into ESI instruction for faculty members who do not currently teach ESI and for those looking to expand the inclusion of ESI in their courses. Based on these findings, departments and administrators are encouraged to foster educators’ agency, support access to professional development and engagement, facilitate interdisciplinary collaboration, and broaden hiring decisions to account for the impact of educators’ holistic identity on their instruction. (shrink)

A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model U of T decidable in X. It is easy to see that $X = 0\prime$ is prime bounding. Denisov claimed that every $X <_{T} 0\prime$ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets $X \leq_{T} 0\prime$ are exactly the sets which are not $low_2$ . Recall that (...) X is $low_2$ if $X\prime\prime$ $\leq_{T} 0\prime$ . To prove that a $low_2$ set X is not prime bounding we use a $0\prime$ -computable listing of the array of sets { Y : Y $\leq_{T}$ X } to build a CAD theory T which diagonalizes against all potential X-decidable prime models U of T. To prove that any $non-low_{2}$ ; X is indeed prime bounding, we fix a function f $\leq_T$ X that is not dominated by a certain $0\prime$ -computable function that picks out generators of principal types. Given a CAD theory T. we use f to eventually find, for every formula $\varphi (\bar{x})$ consistent with T, a principal type which contains it, and hence to build an X-decidable prime model of T. We prove the prime bounding property equivalent to several other combinatorial properties, including some related to the limitwise monotonic functions which have been introduced elsewhere in computable model theory. (shrink)

We use the case of red meat food safety to illustrate the need to problematize policy. Overtime, there have been numerous red meat scandals and scares. We show that the statutes and regulations that arose out of these events provided the industry with a means of demonstrating safety, facilitating large-scale trade, legitimizing conventional production, and limiting interference into its practices. They also created systemic fragility, as evidenced by many recent events, and hindered the development of an alternative, small-scale sector. Thus, (...) the accumulated rules help to structure the sector, create superficial resilience, and are used in place of an actual policy governing safety. We call for rigorous attention to not only food safety, but also the role and effect of agrifood statutes and regulations in general, and engagement in policy more broadly. (shrink)

No recent scholar has ever seriously maintained the genuineness of [Andokides] Oration IV, Against Alkibiades. Against it, one need cite no more than Blass, Attische Beredsamkeit , pp. 325–31; Jebb, Attic Orators , vol. i, pp. 133–9; an, pp. 191–210. The speech is quite ‘out of character’ for Andokides, who was certainly far too young ever to have been in danger of ostrakism as an alternative victim to Nikias or Alkibiades; and there is no reasonable doubt that its ‘dramatic date’ (...) is early in 415, and its ostensible speaker Phaiax, the clever young orator of Aristophanes' Knights , ambassador to Sicily in 422 and butt of Eupolis on divers occasions . These conclusions, however, leave open certain other material questions, especially that of the real date of the composition, on which in turn depends the question how far it can be legitimately used as an historical or biographical source. (shrink)

Widely adopted as a textbook, Issues and Alternatives in Educational Philosophy has been a classic in its field for more than a quarter of a century. As a survey of philosophic issues relevent to the educational profession, it highlights the relationship between philosophic starting points and educational outcomes - between theory and practice. -- from back cover.

We offer a topological treatment of scattered theories intended to help to explain the parallelism between, on the one hand, the theorems provable using Descriptive Set Theory by analysis of the space of countable models and, on the other, those provable by studying a tree of theories in a hierarchy of fragments of infinintary logic. We state some theorems which are, we hope, a step on the road to fully understanding counterexamples to Vaught's Conjecture. This framework is in the early (...) stages of development, and one area for future exploration is the possibility of extending it to a setting in which the spaces of types of a theory are uncountable. (shrink)

The 2010 Nagoya Protocol is an international framework for access and benefit sharing (ABS) of the use of genetic and biological resources, with particular focus on indigenous communities. This is especially important in Africa, where local communities have a close reliance on environmental resources and ecosystems. However, national legislation and policies commonly lag behind international agreements, and this poses challenges for legal compliance as well as practical applications. This study reviews the academic literature on the Nagoya Protocol and ABS applications, (...) and then considers the implications of this analysis for research in Africa. Results show that there is uneven engagement with the principles of the Nagoya Protocol across different academic disciplines; local communities are sometimes sidelined in these studies; and only 8% of researchers in the literature analysed are located in Africa. Future developments should focus on ensuring national compliance with the Nagoya Protocol, and that researchers and industry work in partnership with local African communities on ABS issues. (shrink)

George Knight's "Philosophy and Education" has been a classic in its field for more than a quarter of a century. New features of this revised and updated fourth edition make it of even greater usefulness in the educational philosophy classrooms of a new century. These include an all-new chapter on the Christian teacher in the public school setting; "Points to Ponder" study questions at the end of each chapter; new material addressing the latest relevant issues, including the rise of (...) the home school movement, and the relation of the Intelligent Design debate to Christian educational philosophy; a fresh, new text design, including call-out highlights of major themes; and an updated bibliography and references. (shrink)

Research is increasingly recognised as a key component of medical curricula, offering a range of benefits including development of skills in evidence-based medicine. The literature indicates that experienced academic supervision or mentoring is important in any research activity and positively influences research output. The aim of this project was to investigate the human research ethics experiences and knowledge of three groups: medical students, and university academic staff and clinicians eligible to supervise medical student research projects; at two Australian universities. Training (...) in research ethics was low amongst academic staff and clinicians eligible to supervise medical student research. Only two-thirds of academic staff and students and less than half of clinicians surveyed indicated that specific patient consent was required for a doctor to include patient medical records within a research publication. There was limited awareness of requirements for participant information and consent forms amongst all groups. In the case of clinical trials, fewer clinicians and students than academics indicated there was a requirement to obtain consent. Awareness of the ethics committee focus on respect was low across all groups. This project has identified significant gaps in human research ethics understanding among medical students, and university academic staff and clinicians. The incorporation of research within medical curricula provides the impetus for medical schools and their institutions to ensure that academic staff and clinicians who are eligible and qualified to supervise students’ research projects are appropriately trained in human research ethics. (shrink)

Shepherdson [14] showed that for a discrete ordered ring I, I is a model of IOpen iff I is an integer part of a real closed ordered field. In this paper, we consider integer parts satisfying PA. We show that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ₄), then R must be recursively saturated. In particular, the real closure of I, RC (I), is recursively saturated. We (...) also show that if R is a countable recursively saturated real closed ordered field, then there is an integer part I such that R = RC(I) and I is a nonstandard model of PA. (shrink)

Let R be a real closed field. An integer part I for R is a discretely ordered subring such that for every \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${r \in R}$$\end{document}, there exists an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${i \in I}$$\end{document} so that i ≤ r < i + 1. Mourgues and Ressayre (J Symb Logic 58:641–647, 1993) showed that every real closed field has an integer part. The procedure of Mourgues and (...) Ressayre appears to be quite complicated. We would like to know whether there is a simple procedure, yielding an integer part that is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2(R)}$$\end{document} —limit computable relative to R. We show that there is a maximal Z-ring \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${I \subseteq R}$$\end{document} which is \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2(R)}$$\end{document}. However, this I may not be an integer part for R. By a result of Wilkie (Logic Colloquium ’77), any Z-ring can be extended to an integer part for some real closed field. Using Wilkie’s ideas, we produce a real closed field R with a Z-ring \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${I \subseteq R}$$\end{document} such that I does not extend to an integer part for R. For a computable real closed field, we do not know whether there must be an integer part in the class \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2}$$\end{document}. We know that certain subclasses of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^0_2}$$\end{document} are not sufficient. We show that for each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \in \omega}$$\end{document}, there is a computable real closed field with no n-c.e. integer part. In fact, there is a computable real closed field with no n-c.e. integer part for any n. (shrink)

We extend results of Harizanov and Barker. For a relation R on a recursive structure /oA, we give conditions guaranteeing that the image of R in a recursive copy of /oA can be made to have arbitrary ∑α0 degree over Δα0. We give stronger conditions under which the image of R can be made ∑α0 degree as well. The degrees over Δα0 can be replaced by certain more general classes. We also generalize the Friedberg-Muchnik Theorem, giving conditions on a pair (...) of relations R and S under which the images of R and S can be made ∑α0 and independent over Δα0 in a recursive copy of /oA. (shrink)

We exploit properties of certain directed graphs, obtained from the families of sets with special effective enumeration properties, to generalize several results in computable model theory to higher levels of the hyperarithmetical hierarchy. Families of sets with such enumeration features were previously built by Selivanov, Goncharov, and Wehner. For a computable successor ordinal α, we transform a countable directed graph into a structure such that has a isomorphic copy if and only if has a computable isomorphic copy.A computable structure is (...) categorical if for all computable isomorphic copies of , there is an isomorphism from onto , which is . We prove that for every computable successor ordinal α, there is a computable, categorical structure, which is not relatively categorical. This generalizes the result of Goncharov that there is a computable, computably categorical structure, which is not relatively computably categorical.An additional relation R on the domain of a computable structure is intrinsically on if in all computable isomorphic copies of , the image of R is . We prove that for every computable successor ordinal α, there is an intrinsically relation on a computable structure, which not relatively intrinsically . This generalizes the result of Manasse that there is an intrinsically computably enumerable relation on a computable structure, which is not relatively intrinsically computably enumerable.The dimension of a structure is the number of computable isomorphic copies, up to isomorphisms. We prove that for every computable successor ordinal α and every n≥1, there is a computable structure with dimension n. This generalizes the result of Goncharov that there is a structure of computable dimension n for every n≥1.Finally, we prove that for every computable successor ordinal α, there is a countable structure with isomorphic copies in just the Turing degrees of sets X such that relative to X is not . In particular, for every finite n, there is a structure with isomorphic copies in exactly the non- Turing degrees. This generalizes the result obtained by Wehner, and independently by Slaman, that there is a structure with isomorphic copies in exactly the nonzero Turing degrees. (shrink)

Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δmath image sets, giving conditions under which a relation is intrinsically α-r. e.

Let be a recursive structure, and let R be a recursive relation on . Harizanov isolated a syntactical condition which is necessary and sufficient for to have recursive copies in which the image of R is r.e. of arbitrary r.e. degree. We had conjectured that a certain extension of Harizanov's syntactical condition would be necessary and sufficient for to have recursive copies in which the image of R is ∑α0 of arbitrary ∑α0 degree, but this is not the case. Here (...) we give examples illustrating some restrictions on the possible ∑α0 degrees. In these examples, the image of R cannot be ∑α0 of degree d unless d possesses an “α-table”. (shrink)

We consider the following generalization of the notion of a structure recursive relative to a set X. A relational structure A is said to be a Γ-structure if for each relation symbol R, the interpretation of R in A is ∑math image relative to X, where β = Γ. We show that a certain, fairly obvious, description of classes ∑math image of recursive infinitary formulas has the property that if A is a Γ-structure and S is a further relation on (...) A, then the following are equivalent: For every isomorphism F from A to a Γ-structure, F is ∑math image relative to X, The relation is defined in A by a ∑math image formula with parameters. (shrink)

In [8], the third author defined a reducibility$\le _w^{\rm{*}}$that lets us compare the computing power of structures of any cardinality. In [6], the first two authors showed that the ordered field of reals${\cal R}$lies strictly above certain related structures. In the present paper, we show that$\left \equiv _w^{\rm{*}}{\cal R}$. More generally, for the weak-looking structure${\cal R}$ℚconsisting of the real numbers with just the ordering and constants naming the rationals, allo-minimal expansions of${\cal R}$ℚare equivalent to${\cal R}$. Using this, we show that (...) for any analytic functionf,$\left \equiv _w^{\rm{*}}{\cal R}$. $is noto-minimal.). (shrink)

We improve on and generalize a 1960 result of Maltsev. For a field F, we denote by $H(F)$ the Heisenberg group with entries in F. Maltsev showed that there is a copy of F defined in $H(F)$, using existential formulas with an arbitrary non-commuting pair of elements as parameters. We show that F is interpreted in $H(F)$ using computable $\Sigma _1$ formulas with no parameters. We give two proofs. The first is an existence proof, relying on a result of Harrison-Trainor, (...) Melnikov, R. Miller, and Montalbán. This proof allows the possibility that the elements of F are represented by tuples in $H(F)$ of no fixed arity. The second proof is direct, giving explicit finitary existential formulas that define the interpretation, with elements of F represented by triples in $H(F)$. Looking at what was used to arrive at this parameter-free interpretation of F in $H(F)$, we give general conditions sufficient to eliminate parameters from interpretations. (shrink)

We show that for every computable limit ordinal α, there is a computable structure A that is $\Delta _\alpha ^0 $ categorical, but not relatively $\Delta _\alpha ^0 $ categorical (equivalently. it does not have a formally $\Sigma _\alpha ^0 $ Scott family). We also show that for every computable limit ordinal a, there is a computable structure A with an additional relation R that is intrinsically $\Sigma _\alpha ^0 $ on A. but not relatively intrinsically $\Sigma _\alpha ^0 $ (...) on A (equivalently, it is not definable by a computable $\Sigma _\alpha $ formula with finitely many parameters). Earlier results in [7], [10], and [8] establish the same facts for computable successor ordinals α. (shrink)

Let ???? be a computable structure and let R be a new relation on its domain. We establish a necessary and sufficient condition for the existence of a copy ℬ of ???? in which the image of R (¬R, resp.) is simple (immune, resp.) relative to ℬ. We also establish, under certain effectiveness conditions on ???? and R, a necessary and sufficient condition for the existence of a computable copy ℬ of ???? in which the image of R (¬R, resp.) (...) is simple (immune, resp.). (shrink)

In 1905 William James wrote an essay in McClure's Magazine recalling the importance to his own work of the Scottish-born philosopher Thomas Davidson. In the essay, James states that Davidson was "essentially a teacher." What is interesting when one looks at Davidson's life and work is that, for Davidson, teaching does seem to be an essential feature of what it means to be a philosopher. Here, I develop how Davidson construes this linking of philosophy and teaching with a concluding emphasis (...) on the two schools he established: Glenmore, a summer philosophy program in the Adirondacks and the "Breadwinners' College," an open school he began for working persons in New York City. I offer this as a discussion paper so that James's recollection of Davidson's importance to his own work may provoke us to consider how we presently understand the linking of teaching and philosophy. This seems especially appropriate for an academic culture such as ours in which much of our time is spent teaching and in which we are often primarily evaluated by a separate category of professional "research." The American tradition has "lost" any number of its important.. (shrink)

We study the weak truth table degree spectra of first-order relational structures. We prove a dichotomy among the possible wtt degree spectra along the lines of Knight’s upward-closure theorem for Turing degree spectra. We prove new results contrasting the wtt degree spectra of finite- and infinite-signature structures. We show that, as a method of defining classes of reals, the wtt degree spectrum is, except for some trivial cases, strictly more expressive than the Turing degree spectrum.

What is "critical thinking"? -- What is "law"? : thinking critically about legal perspectives -- Putting critical thinking into legal practice -- Thinking critically about assessments -- Thinking critically in the workplace and beyond.